A fast marching level set method for monotonically advancing fronts.

نویسنده

  • J A Sethian
چکیده

A fast marching level set method is presented for monotonically advancing fronts, which leads to an extremely fast scheme for solving the Eikonal equation. Level set methods are numerical techniques for computing the position of propagating fronts. They rely on an initial value partial differential equation for a propagating level set function and use techniques borrowed from hyperbolic conservation laws. Topological changes, corner and cusp development, and accurate determination of geometric properties such as curvature and normal direction are naturally obtained in this setting. This paper describes a particular case of such methods for interfaces whose speed depends only on local position. The technique works by coupling work on entropy conditions for interface motion, the theory of viscosity solutions for Hamilton-Jacobi equations, and fast adaptive narrow band level set methods. The technique is applicable to a variety of problems, including shape-from-shading problems, lithographic development calculations in microchip manufacturing, and arrival time problems in control theory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wave front evolution in strongly heterogeneous layered media using the fast marching method

S U M M A R Y The fast marching method (FMM) is a grid based numerical scheme for tracking the evolution of monotonically advancing interfaces via finite-difference solution of the eikonal equation. Like many other grid based techniques, FMM is only capable of finding the first-arriving phase in continuous media; however, it distinguishes itself by combining both unconditional stability and rap...

متن کامل

A Fast Marching Method for Hamilton-Jacobi Equations Modeling Monotone Front Propagations

In this paper we present a generalization of the Fast Marching method introduced by J. A. Sethian in 1996 to solve numerically the eikonal equation. The new method, named Buffered Fast Marching (BFM), is based on a semi-Lagrangian discretization and is suitable for Hamilton-Jacobi equations modeling monotonically advancing fronts, including Hamilton-Jacobi-Bellman and Hamilton-JacobiIsaacs equa...

متن کامل

An O ( N ) Level Set Method

A propagating interface can develop corners and discontinuities as it advances. Level set algorithms have been extensively applied for the problems in which the solution has advancing fronts. One of the most popular level set algorithms is the so called fast marching method (FMM), which requires total O(N log2N) operations, where N is the number of grid points. The article is concerned with the...

متن کامل

Numerical Methods for Advancing Interfaces

A propagating interface can develop corners and discontinuities as it advances. The level set algorithm such as the fast marching method (FMM) has been extensively applied in simulating advancing fronts. However, it is a rstorder scheme and hard to incorporate higher-order schemes in realistic media; it costs O(N log2N), where N is the number of grid points. The article is concerned with the de...

متن کامل

A comparative evaluation of algorithms for fast computation of level set PDEs with applications to motion segmentation

We address the problem of fast computation of level set partial differential equations (PDEs) in the context of motion segmentation. Although several fast level set computation algorithms are known, some of them, such as the fast marching method, are not applicable to the video segmentation problem since the front being computed does not advance monotonically. We study narrow-banding, pyramidal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Proceedings of the National Academy of Sciences of the United States of America

دوره 93 4  شماره 

صفحات  -

تاریخ انتشار 1996